NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
51	New Results on Maximum Induced Matchings in Bipartite Graphs and Beyond Konrad K. Dabrowskia,b , Marc Demangec,d , Vadim V. Lozina a DIMAP b School Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2013-03-14 00:55:15 Graph theory Graph operations NP-complete problems Bipartite graphs Combinatorial optimization Matching Line graph Chordal graph Clique Complete bipartite graph Independent set Cograph
52	Scalable Flow-Based Community Detection for Large-Scale Network Analysis Seung-Hee Bae∗ , Daniel Halperin∗ , Jevin West† , Martin Rosvall‡ and Bill Howe∗ ∗ Department of Computer Science and Engineering, Uni Add to Reading List Source URL: www.jevinwest.org Language: English - Date: 2015-11-11 00:05:03 Mathematics Computational complexity theory NP-complete problems Algorithm Mathematical logic Theoretical computer science Graph partition Community structure Connectivity
53	1. Austin, We Have Two Problems by Ucaoimhu A certain well-known figure was, fortunately, well trained to deal with certain problems as they arose. Specifically: (1) For thirteen Down clues, the string of letters produce Add to Reading List Source URL: www.math.uchicago.edu Language: English - Date: 2013-07-05 20:53:08 Cluedo Gaming NP-complete problems Mind
54	A Constant-Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem Amit Kumar ∗ Anupam Gupta† Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2004-09-21 15:30:36 Graph theory Mathematics Computational complexity theory NP-complete problems Combinatorial optimization Edsger W. Dijkstra Spanning tree Operations research Shortest path problem Graph Linear programming Steiner tree problem
55	IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 26, NO. X, Add to Reading List Source URL: www.cs.uoi.gr Language: English - Date: 2014-10-21 22:17:09 Mathematics Operations research Computational complexity theory Combinatorics Combinatorial optimization NP-complete problems Set cover problem Greedy algorithm Heuristic Integer programming Matching Linear programming
56	Contracting a chordal graph to a split graph or a tree? Petr A. Golovach1 , Marcin Kami´ nski2 , and 1 Dani¨el Paulusma Add to Reading List Source URL: rutcor.rutgers.edu Language: English - Date: 2011-07-20 16:48:47 Graph theory Graph operations NP-complete problems Chordal graph Clique Graph minor Edge contraction Tree decomposition Vertex Split graph Graph Independent set
57	Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces and its Applications Otfried Schwarzkopf y Add to Reading List Source URL: www.math.tau.ac.il Language: English - Date: 2012-06-29 10:28:55 Graph theory Graph connectivity Topological graph theory Planar graph Graph coloring Bridge NP-complete problems Graph drawing Pathwidth Matching
58	An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs George B. Mertzios and Walter Unger Department of Computer Science RWTH Aachen, Germany {mertzios, quax}@cs.rwth-aachen.de Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2008-11-30 14:19:38 Graph theory NP-complete problems Graph operations Graph coloring Interval graph Hamiltonian path Bipartite graph Ear decomposition Indifference graph Chordal graph Cograph Strongly chordal graph
59	CS264: Beyond Worst-Case Analysis The Top 10 List∗ Tim Roughgarden† December 3, 2014 We covered a lot of concepts in this course. To appreciate this, let’s review the overarching narrative of the course via a top 1 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-12-24 18:09:21 Computational complexity theory Theory of computation Mathematics Analysis of algorithms Operations research Mathematical optimization NP-complete problems Smoothed analysis Algorithm Competitive analysis Best worst and average case Time complexity
60	First round Dutch Mathematical Olympiad 20 January – 30 January 2014 • Time available: 2 hours. • The A-problems are multiple choice questions. Exactly one of the five given options is correct. Please Add to Reading List Source URL: www.wiskundeolympiade.nl Language: English - Date: 2015-04-10 06:17:56 Mathematics NP-complete problems Addition Elementary arithmetic Mathematical notation Logic puzzles

UPDATE